Packing dimers on(2p+1)×(2q+1)lattices
نویسندگان
چکیده
منابع مشابه
Hunting dimers
HBCBH and HAlCAlH are related electrondeficient molecules, predicted as local minima on their respective potential energy surfaces. Different views of their electronic structure—as allenes, carbenes, or carbones—prompted two research groups to a friendly competition exploring the predilection of these small molecules to dimerize. Many such dimers emerged from the calculations, some with large e...
متن کاملCombination of Cα-H Hydrogen Bonds and van der Waals Packing Modulates the Stability of GxxxG-Mediated Dimers in Membranes.
The GxxxG motif is frequently found at the dimerization interface of a transmembrane structural motif called GASright, which is characterized by a short interhelical distance and a right-handed crossing angle between the helices. In GASright dimers, such as glycophorin A (GpA), BNIP3, and members of the ErbB family, the backbones of the helices are in contact, and they invariably display networ...
متن کاملStrip Packing vs. Bin Packing
In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithms to strip packing. More precisely we obtain the following results: (1) Any offline bin packing algorithm can be applied to strip packing maintaining the same asymptotic worst-case ratio. Thus using FFD (MFFD) as a su...
متن کاملOn Open Packing Number of Graphs
In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.
متن کاملPacking Graphs: The packing problem solved
Abstract For every fixed graph H, we determine the H-packing number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, P (H, Kn) = b 2h b n − 1 d cc, unless n = 1 mod d and n(n − 1)/d = b mod (2h/d) where 1 ≤ b ≤ d, in which case P (H, Kn) = b 2h b n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2006
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.73.016106